Bounds on the response time under control constraints

Efficient computation of response time bounds under fixed-priority scheduling

All algorithms currently known for computing the response time of tasks scheduled under fixed-priority scheduling have run-time pseudo-polynomial in the representation of the task system. We derive a formula that can be computed in polynomial time for determining an upper bound on response times; our upper bound on response time has the added benefit of being continuous in the task system param...

Improved Bounds on Families Under k -wise Set-Intersection Constraints

Let p be a prime, and let L be a set of s congruence classes modulo p. Let H be a family of subsets of [n] such that the size modulo p of each member of H is not in L, but the size modulo p of every intersection of k distinct members of H is in L. We prove that |H| ≤ (k − 1) ∑s i=0 ( n−1 i ) , improving the bound due to Grolmusz and generalizing results proved for k = 2 by Snevily.

Discrete-time network-based control under scheduling and actuator constraints

This paper is concerned with the solution bounds for discrete-time networked control systems via delay-dependent Lyapunov–Krasovskii methods. Solution bounds are widely used for systems with input saturation caused by actuator saturation or by the quantizers with saturation. The time-delay approach has been developed recently for the stabilization of continuous-time networked control systems un...

Practical Constraints on Collaterals under Iranian Law

Multiagent Negotiation under Time Constraints

Research in distributed artificial intelligence (DAI) is concerned with how automated agents can be designed to interact effectively. Negotiation is proposed as a means for agents to communicate and compromise to reach mutually beneficial agreements. The paper examines the problems of resource allocation and task distribution among autonomous agents which can benefit from sharing a common resou...